The Average Tree Permission Value for Games with a Permission Tree
نویسندگان
چکیده
منابع مشابه
The Average Tree Permission Value for Games with a Permission Tree
In the literature various models of games with restricted cooperation can be found. In those models, instead of allowing for all subsets of the set of players to form, it is assumed that the set of feasible coalitions is a proper subset of the power set of the set of players. In this paper we consider such sets of feasible coalitions that follow from a permission structure on the set of players...
متن کاملComparable Characterizations of Four Solutions for Permission Tree Games
In the field of cooperative games there is an extensive literature that studies situations of restricted cooperation. Myerson (1979) introduced communication graph games, where players can only cooperate if they are connected in an undirected graph representing the communication possibilities. The Myerson value of such a game is obtained by taking the Shapley value of the corresponding restrict...
متن کاملThe average covering tree value for directed graph games
We introduce a single-valued solution concept, the so-called average covering tree value, for the class of transferable utility games with limited communication structure represented by a directed graph. The solution is the average of the marginal contribution vectors corresponding to all covering trees of the directed graph. The covering trees of a directed graph are those (rooted) trees on th...
متن کاملAxiomatizations of Banzhaf permission values for games with a permission structure
In games with a permission structure it is assumed that players in a cooperative transferable utility game are hierarchically ordered in the sense that there are players that need permission from other players before they are allowed to cooperate. We provide axiomatic characterizations of Banzhaf permission values being solutions that are obtained by applying the Banzhaf value to modified TU-ga...
متن کاملAverage tree solutions for graph games
In this paper we consider cooperative graph games being TU-games in which players cooperate if they are connected in the communication graph. We focus our attention to the average tree solutions introduced by Herings, van der Laan and Talman [6] and Herings, van der Laan, Talman and Yang [7]. Each average tree solution is defined with respect to a set, say T , of admissible rooted spanning tree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2013
ISSN: 1556-5068
DOI: 10.2139/ssrn.2206216